Convexity and log convexity for the spectral radius

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convexity and Log Convexity for the Spectral Radius

The starting point of this paper is a theorem by J. F. C. Kingman which asserts that if the entries of a nonnegative matrix are log convex functions of a variable then so is the spectral radius of the matrix. A related result of J. Cohen asserts that the spectral radius of a nonnegative matrix is a convex function of the diagonal elements. The first section of this paper gives a new, unified pr...

متن کامل

A Sharpened Condition for Strict Log-Convexity of the Spectral Radius via the Bipartite Graph

Friedland (1981) showed that for a nonnegative square matrix A, the spectral radius r(eA) is a log-convex functional over the real diagonal matrices D. He showed that for fully indecomposable A, log r(eA) is strictly convex over D1,D2 if and only if D1 −D2 6= c I for any c ∈ R. Here the condition of full indecomposability is shown to be replaceable by the weaker condition that A and A>A be irre...

متن کامل

Bell Numbers, Log-concavity, and Log-convexity

Let fb k (n)g 1 n=0 be the Bell numbers of order k. It is proved that the sequence fb k (n)=n!g 1 n=0 is log-concave and the sequence fb k (n)g 1 n=0 is log-convex, or equivalently, the following inequalities hold for all n 0, 1 b k (n + 2)b k (n) b k (n + 1) 2 n + 2 n + 1 : Let f(n)g 1 n=0 be a sequence of positive numbers with (0) = 1. We show that if f(n)g 1 n=0 is log-convex, then (n)(m) (n...

متن کامل

Log–convexity of Combinatorial Sequences from Their Convexity

A sequence (xn)n 0 of positive real numbers is log-convex if the inequality xn xn−1xn+1 is valid for all n 1 . We show here how the problem of establishing the log-convexity of a given combinatorial sequence can be reduced to examining the ordinary convexity of related sequences. The new method is then used to prove that the sequence of Motzkin numbers is log-convex.

متن کامل

Preserving Log-Convexity for Generalized Pascal Triangles

We establish the preserving log-convexity property for the generalized Pascal triangles. It is an extension of a result of H. Davenport and G. Pólya “On the product of two power series”, who proved that the binomial convolution of two log-convex sequences is log-convex.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1986

ISSN: 0024-3795

DOI: 10.1016/0024-3795(86)90233-8